Orbit-Stabilizer Theorem

Orbit-Stabilizer Theorem

Introduction

The Orbit-Stabilizer Theorem is one of the most useful theorems in group theory. It provides a fundamental relationship between the size of orbits and the index of stabilizers, offering a powerful tool for counting and understanding group actions.

Statement

Theorem 6.2 (Orbit-Stabilizer Theorem): Let a finite group G act on a set X. For any xX, the size of the orbit of x is equal to the index of its stabilizer subgroup:

|OrbG(x)|=|G||StabG(x)|

This theorem provides a powerful formula: |G|=|OrbG(x)||StabG(x)|.

Proof Sketch

The proof uses the fact that there is a bijection between the orbit of x and the set of left cosets of the stabilizer of x. Specifically, the map gxgStabG(x) is a well-defined bijection.

Key Steps in the Proof

  1. Define the map: ϕ:OrbG(x)G/StabG(x) by ϕ(gx)=gStabG(x)

  2. Show it's well-defined: If g1x=g2x, then g11g2StabG(x), so g1StabG(x)=g2StabG(x)

  3. Show it's injective: If ϕ(g1x)=ϕ(g2x), then g1x=g2x

  4. Show it's surjective: Every coset gStabG(x) is the image of gx

  5. Conclude: Since there's a bijection, |OrbG(x)|=[G:StabG(x)]=|G|/|StabG(x)|

Examples

Example 1: Action of S3 on {1,2,3}

Consider the natural action of S3 on {1,2,3}:

Example 2: Action of D4 on Vertices

Consider the action of D4 on the vertices of a square:

Example 3: Conjugation Action

When a group G acts on itself by conjugation:

Applications

Application 1: Counting Orbits

The orbit-stabilizer theorem is often used to count the number of elements in orbits, which is useful in combinatorics and group theory.

Application 2: Understanding Group Structure

The theorem helps us understand the structure of groups by relating orbit sizes to subgroup indices.

Application 3: Class Equation

When a group acts on itself by conjugation, the orbit-stabilizer theorem leads to the class equation, which is fundamental for understanding the structure of finite groups.

Application 4: Burnside's Lemma

The orbit-stabilizer theorem is used in the proof of Burnside's Lemma, which counts the number of orbits.

Special Cases

Transitive Actions

If the action is transitive, then |OrbG(x)|=|X| for all xX, so |G|=|X||StabG(x)|.

Free Actions

If the action is free, then |StabG(x)|=1 for all xX, so |OrbG(x)|=|G|.

Regular Actions

If the action is regular (transitive and free), then |G|=|X|.